Soft-in soft-out decoding of Reed-Solomon codes based on Vardy and Be'ery's decomposition

نویسندگان

  • Thomas R. Halford
  • V. Ponnampalam
  • Alex J. Grant
  • Keith M. Chugg
چکیده

This correspondence presents an optimal soft-in soft-out (SISO) decoding algorithm for the binary image of Reed–Solomon (RS) codes that is based on Vardy and Be’ery’s optimal soft-in hard-out algorithm. A novel suboptimal list-based SISO decoder that exploits Vardy and Be’ery’s decomposition is also presented. For those codes with very high rate, which allows practical decoding with the proposed algorithms, the proposed suboptimal SISO significantly outperforms standard list-based decoding techniques in iteratively decoded systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Title of dissertation: PERFORMANCE ANALYSIS OF ALGEBRAIC SOFT-DECISION DECODING OF REED-SOLOMON CODES

Title of dissertation: PERFORMANCE ANALYSIS OF ALGEBRAIC SOFT-DECISION DECODING OF REED-SOLOMON CODES Andrew Duggan, Masters of Science, 2006 Thesis directed by: Professor Alexander Barg Department of Electrical and Computer Engineering We investigate the decoding region for Algebraic Soft-Decision Decoding (ASD) of Reed-Solomon codes in a discrete, memoryless, additive-noise channel. An expres...

متن کامل

Soft decoding of algebraic–geometric codes using Koetter-Vardy algorithm

The first soft-decision decoding algorithm for algebraic–geometric codes is presented. This algorithm is developed based on the Koetter-Vardy algorithm, which was proposed for the decoding of Reed-Solomon codes. The interpolation process is modified by redefining the zero condition of a trivariate polynomial and introducing complexity reducing methods. Simulation results show that 0.7 and 1.7 d...

متن کامل

A Vlsi Architecture for Interpolation in Soft-decision List Decoding of Reed-solomon Codes

The Koetter-Vardy algorithm is an algebraic soft-decision decoder for Reed-Solomon codes which is based on the Guruswami-Sudan list decoder. There are three main steps: 1) multiplicity calculation, 2) interpolation and 3) root finding. The Koetter-Vardy algorithm is challenging to implement due to the high cost of interpolation. We propose a VLSI architecture for interpolation that uses a trans...

متن کامل

Efficient Interpolation and Factorization in Algebraic Soft-Decision Decoding of Reed-Solomon Codes

Algebraic soft-decision decoding of Reed-Solomon codes delivers promising coding gains over conventional hard-decision decoding. The main computational steps in algebraic soft-decoding (as well as Sudan-type list-decoding) are bivariate interpolation and factorization. We discuss a new computational technique, based upon re-encoding and coordinate transformation, that significantly reduces the ...

متن کامل

Algebraic Soft-Decision Decoding of Reed-Solomon Codes Using Bit-level Soft Information

The performance of algebraic soft-decision decoding (ASD) of Reed-Solomon (RS) codes using bit-level soft information is investigated. Optimal multiplicity assignment strategies (MAS) of ASD with infinite cost are first studied over erasure channels and binary symmetric channels (BSC). The corresponding decoding radii are calculated in closed forms and tight bounds on the error probability are ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 51  شماره 

صفحات  -

تاریخ انتشار 2005